Cooperating distributed garbage collectors for clusters and beyond

نویسنده

  • Michael Philippsen
چکیده

The contribution of this paper is twofold. First a distributed garbage collector (DGC) is presented that is optimized for remote method invocation in reliable networks, such as current clusters of workstations. Since the algorithm does not require extra acknowledgement messages, even while collecting, it does not increase the latency of a remote call. Then it is discussed how several DGCs can cooperate in networks that consist of different areas with respect to communication, i.e., of areas with different reliability properties. Proper placement and use of bridge objects allow to select an optimized DGC for every area.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Collection Schemes for Distributed Garbage

With the continued growth in interest in distributed systems, garbage collection is actively receiving attention by designers of distributed languages [Bal, 1990]. Distribution adds another dimension of complexity to an already complex problem. A comprehensive review and bibliography of distributed garbage collection literature up to 1992 is presented. As distributed collectors are largely base...

متن کامل

Back-Tracing over Distributed Persistent Storage Without Transactions

Orthogonally persistent automatic storage management provides a useful abstraction over stable secondary storage, in contrast to manual storage management which is complex, error-prone and tedious. The provision of the persistence abstraction over a cluster of storage nodes provides this abstraction in conjunction with mainframe-level aggregate IO performance, necessary for the support of high ...

متن کامل

Distributed Garbage Collection Algorithms

This seminar report presents adoptions of uniprocessor garbage collection techniques which are able to operate in a new context: distributed systems. We see that their application to distributed system poses new problems and that there is currently no algorithm available solving, or even addressing, all of them. The presented algorithms are structured according to their belonging family: refere...

متن کامل

Ensuring the Safety of Distributed Garbage Collection in DMOS

An orthogonally persistent system maintains data beyond any program execution. The principle of persistence identification implies that persistence by reachability be used to determine which objects are to be maintained in the store. A particular execution may cause objects to become unreachable—garbage. Any efficient implementation of a persistent system must incorporate a garbage collector to...

متن کامل

Implementing a Family of Distributed Garbage Collectors

This paper discusses implementations of distributed garbage collectors derived using a previously developed methodology which involves mappings of distributed termination detection algorithms (DTAs) to local garbage collection schemes. Implementations produced by such mappings preserve the safety and completeness properties of the original local collectors. Through our collector implementations...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Concurrency - Practice and Experience

دوره 12  شماره 

صفحات  -

تاریخ انتشار 2000